Online Algorithm for Parallel Job Scheduling and Strip Packing
نویسندگان
چکیده
We consider the online scheduling problem of parallel jobs on parallel machines, P |online − list,mj |Cmax. For this problem we present a 6.6623-competitive algorithm. This improves the best known 7competitive algorithm for this problem. The presented algorithm also applies to the special case where machines are ordered on a line and only adjacent machines can be assigned to a job and, therefore, also to online orthogonal strip packing. Since previous results for online orthogonal strip packing assume bounded rectangles, the presented algorithm is the first with a constant competitive ratio.
منابع مشابه
Improved online algorithms for parallel job scheduling and strip packing
We consider the online scheduling problem of parallel jobs on parallel machines, P |online − list,mj|Cmax. For this problem we present a 6.6623-competitive algorithm. This improves the best known 7-competitive algorithm for this problem. The presented algorithm also applies to the problem where machines are ordered on a line and only adjacent machines can be assigned to a job and, therefore, al...
متن کاملApproximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Main subject of this thesis are approximation algorithms for scheduling and packing, two classical geometrical problems in combinatorial optimization. It is divided into three parts. In the first part we consider a generalization of the strip packing problem or geometrical cutting stock problem. In strip packing a given set of rectangles has to be placed into a strip of fixed width and infinite...
متن کاملOnline Scheduling & Project Scheduling
This thesis presents new and improved scheduling algorithms for a number of scheduling problems. The first part of the thesis deals with two online-list scheduling problems, both with the objective to minimize the makespan. In these problems, the jobs arrive one by one and the decision maker has to irrevocably schedule the arriving job before the next job becomes known. In the second part, a ne...
متن کاملA Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...
متن کاملOn-line Algorithms for a Parallel Job Scheduling Problem
In this paper, we consider a simple model for parallel job scheduling with computation and communication costs. For each job Jj with processing time pj , if kj processors are assigned to execute the job then the actual execution time of the job is pj=kj + kj , where the constant is the communication cost (or in general the overhead cost) associated with each processor. We define a scheduling pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007